Linear area upward drawings of AVL trees
نویسندگان
چکیده
منابع مشابه
Linear area upward drawings of AVL trees
We prove that any AVL tree admits a linear-area straight-line strictly-upward planar grid drawing, that is, a drawing in which (a) each edge is mapped into a single straight-line segment, (b) each node is placed below its parent, (c) no two edges intersect, and (d) each node is mapped into a point with integer coordinates. © 1998 Elsevier Science B.V.
متن کاملArea-eecient Upward Tree Drawings
Rooted trees are usually drawn planar and upward , i.e., without crossings and with parents placed above their children. In this paper we investigate the area requirement of planar upward drawings of trees, and present optimal algorithms for constructing such drawings.
متن کاملStrictly-upward Drawings of Ordered Search Trees
We prove that any logarithmic binary tree admits a linear-area straight-line strictly-upward planar grid drawing (in short, strictly-upward drawing), that is, a drawing in which (a) each edge is mapped into a single straight-line segment, (b) each node is placed below its parent, (c) no two edges intersect, and (d) each node is mapped into a point with integer coordinates. Informally, a logarit...
متن کاملMinimum-Layer Upward Drawings of Trees
An upward drawing of a rooted tree T is a planar straight-line drawing of T where the vertices of T are placed on a set of horizontal lines, called layers, such that for each vertex u of T , no child of u is placed on a layer vertically above the layer on which u has been placed. In this paper we give a linear-time algorithm to obtain an upward drawing of a given rooted tree T on the minimum nu...
متن کاملPlanar upward tree drawings with optimal area
Rooted trees are usually drawn planar and upward i e without crossings and with out any parent placed below its child In this paper we investigate the area requirement of planar upward drawings of rooted trees We give tight upper and lower bounds on the area of various types of drawings and provide linear time algorithms for constructing optimal area drawings Let T be a bounded degree rooted tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1998
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(97)00013-8